Probabilistic fault localization with sliding windows
نویسندگان
چکیده
منابع مشابه
Probabilistic k-Skyband Operator over Sliding Windows
Given a set of data elements D in a d-dimensional space, a k-skyband query reports the set of elements which are dominated by at most k − 1 other elements in D. k-skyband query is a fundamental query type in data analyzing as it keeps a minimum candidate set for all top-k ranking queries where the ranking functions are monotonic. In this paper, we study the problem of k-skyband over uncertain d...
متن کاملExtending Probabilistic Data Fusion Using Sliding Windows
Recent developments in the field of data fusion have seen a focus on techniques that use training queries to estimate the probability that various documents are relevant to a given query and use that information to assign scores to those documents on which they are subsequently ranked. This paper introduces SlideFuse, which builds on these techniques, introducing a sliding window in order to co...
متن کاملGlr Tests for Fault Detection over Sliding Data Windows
The Generalized Likelihood Ratio (GLR) test for fault detection as derived by Willsky and Jones is a recursive method to detect additive changes in linear systems in a Kalman filter framework. Here, we evaluate the GLR test on a sliding window and compare it to stochastic parity space approaches. Robust fault detection defined as being insensitive to faults in the signal space is also studied i...
متن کاملSliding Windows with Limited Storage
We consider time-space tradeoffs for exactly computing frequency moments and order statistics over sliding windows [16]. Given an input of length 2n− 1, the task is to output the function of each window of length n, giving n outputs in total. Computations over sliding windows are related to direct sum problems except that inputs to instances almost completely overlap. • We show an average case ...
متن کاملSliding-Windows for Rapid Object Class Localization: A Parallel Technique
This paper presents a fast object class localization framework implemented on a data parallel architecture currently available in recent computers. Our case study, the implementation of Histograms of Oriented Gradients (HOG) descriptors, shows that just by using this recent programming model we can easily speed up an original CPUonly implementation by a factor of 34, making it unnecessary to us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2012
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-012-4567-x